A Synchronous Bisimulation Based Approach for Information Flow Analysis
نویسندگان
چکیده
A process algebra is defined where parallel composition is structured around synchronous communication. Its essential difference with CCS is the hypothesis that internal actions must be observable for the clock; consequently, in our formalism (strong) bisimulation will be the basis for information flow analysis, instead of equivalences based on trace or weak bisimulation. Bisimulation reduces in our formalism to equality modulo an ACUID equational theory extended with prefixes. We show that information flow analysis based on our formalism is finer than analyzes based on trace or weak bisimulation.
منابع مشابه
Information Flow Analysis via Equational Reasoning
In this work, a process algebra is designed around an ACUID equational theory extended with prefixes symbolizing actions, and by making parallel synchronous composition distributive over non-deterministic choice; such a synchronous composition is commutative and non-associative. Bisimulation between processes is then interpretable as congruence over such an equational theory. It is shown that i...
متن کاملInformation flow in systems with schedulers, Part I: Definitions
This paper studies information flow security in a synchronous state machine model, in which agents share a global clock and can make observations at all times, but in which an agents’ ability to perform actions is subject to a scheduler. A number of definitions of security for this setting are proposed, depending on whether the attacker is active or passive, whether the security should be robus...
متن کاملBisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols
In this paper, we first define bisimulation-based non-deterministic admissible interference (BNAI), derive its process-theoretic characterisation and present a compositional verification method with respect to the main operators over communicating processes, generalising in this way the similar trace-based results obtained [J. Univ. Comput. Sci. 6 (2000) 1054] into the finer notion of observati...
متن کاملVerifying Weak Probabilistic Noninterference
Weak probabilistic noninterference is a security property for enforcing confidentiality in multi-threaded programs. It aims to guarantee secure flow of information in the program and ensure that sensitive information does not leak to attackers. In this paper, the problem of verifying weak probabilistic noninterference by leveraging formal methods, in particular algorithmic verification, is disc...
متن کاملAn Effective Attack-Resilient Kalman Filter-Based Approach for Dynamic State Estimation of Synchronous Machine
Kalman filtering has been widely considered for dynamic state estimation in smart grids. Despite its unique merits, the Kalman Filter (KF)-based dynamic state estimation can be undesirably influenced by cyber adversarial attacks that can potentially be launched against the communication links in the Cyber-Physical System (CPS). To enhance the security of KF-based state estimation, in this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003